Connectivity for quantum graphs

In Quantum Information Theory there is a construction for quantum channels, appropriately called graph, that generalizes the confusability graph classical channels in information theory. this paper definition of connectedness graphs provided, which definition. It shown several examples well-known (quantum Hamming cubes and expanders) are connected. A version particular case tree-packing theorem from Graph also proved. Generalizations related notions k-connectedness orthogonal representation proposed graphs, it representations have same implications as they do case.